Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems
نویسندگان
چکیده
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملTwo Interior-point Methods for Nonlinear P ( )-complementarity Problems
1 The authors would like to thank two anonymous referees for their helpful suggestions leading to a improved presentation of the paper. Abstract. Two interior-point algorithms using a wide neighborhood of the central path are proposed to solve nonlinear P-complementarity problems. The proof of the polynomial complexity of the rst method requires that the problem satisses a scaled Lipschitz cond...
متن کاملA New Interior Point Algorithm for Nonlinear Complementarity Problems
1. Abstract The complementarity problem consists in finding x ∈ IR such that x ≥ 0 , F (x) ≥ 0 and xF (x) = 0, where F : IR → IR. Complementarity problems are involved in several applications in engineering, economy and different branches of physics . We mention contact problems and dynamics of multiple bodies systems in solid mechanics. In this paper we present a new feasible interior point al...
متن کاملimproved infeasible-interior-point algorithm for linear complementarity problems
we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2002
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0201017l